منابع مشابه
Certificate Transparency with Privacy
Certificate transparency (CT) is an elegant mechanism designed to detect when a certificate authority (CA) has issued a certificate incorrectly. Many CAs now support CT and it is being actively deployed in browsers. However, a number of privacy-related challenges remain. In this paper we propose practical solutions to two issues. First, we develop a mechanism that enables web browsers to audit ...
متن کاملTransparency of overdense plasma with V shape density profile
In this study, we investigate the transparency of an overdense inhomogeneous plasma slab. This anomalous transmission is achieved when the conditions provided for the incident electromagnetic wave to excite coupled surface waves on the both sides of the slab. These conditions require that the homogeneous overdense plasma, or the metallic film, is placed between two dielectric layers. Here, the ...
متن کاملA Joining Shortest Queue with MAP Inputs
In this paper we study a MAP/M/K system with join-the-shortest-queue (JSQ) discipline which consists of K servers and K queues with infinite buffers. An arrival joins the shortest queue and in the case that there are n (n≤ K) queues having the same shortest length, the customer will join any one of these shortest queues with probability 1/n. We model the system as a levelexpanding QBD (LDQBD) p...
متن کاملJoining and Rotating Data with Molecules
| DNA{based computing is an attempt to solve computational problems with a large number of DNA molecules. Many theoretical results have been reported so far, but their conclusions are seldom supported in experiments. We suggest data encoded in the form of (tag data tag)+, and report our experimental results of performing concatenation and rotation of DNA. Our results also show the possibility o...
متن کاملLimits to Joining with Generics and Randoms
Posner and Robinson [4] proved that if S ⊆ ω is non-computable, then there exists a G ⊆ ω such that S ⊕ G ≥T G′. Shore and Slaman [7] extended this result to all n ∈ ω, by showing that if S T ∅(n−1) then there exists a G such that S ⊕ G ≥T G(n). Their argument employs KumabeSlaman forcing, and so the set they obtain, unlike that of the Posner-Robinson theorem, is not generic for Cohen forcing i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Laser Technik Journal
سال: 2009
ISSN: 1613-7728,1863-9119
DOI: 10.1002/latj.200990074